Simultaneous straight-line drawing of a planar graph and its rectangular dual
نویسنده
چکیده
A natural way to represent on the plane both a planar graph and its dual is to follow the definition of the dual, thus, to place vertices inside their corresponding primal faces, and to draw the dual edges so that they only cross their corresponding primal edges. The problem of constructing such drawings has a long tradition when the drawings of both primal and dual are required to be straight-line. We consider the same problem for a planar graph and its rectangular dual. We show that the rectangular dual can be resized to host a planar straight-line drawing of its primal.
منابع مشابه
Geometric RAC Simultaneous Drawings of Graphs
In this paper, we study the geometric RAC simultaneous drawing problem: Given two planar graphs that share a common vertex set but have disjoint edge sets, a geometric RAC simultaneous drawing is a straight-line drawing in which (i) each graph is drawn planar, (ii) there are no edge overlaps, and, (iii) crossings between edges of the two graphs occur at right-angles. We first prove that two pla...
متن کاملAlgorithms for Drawing Plane Graphs
Graph drawing addresses the problem of constructing geometric representation of information and finds applications in almost every branch of science and technology. Efficient algorithms are essential for automatic drawings of graphs, and hence a lot of research has been carried out in the last decade by many researchers over the world to develop efficient algorithms for drawing graphs. In this ...
متن کاملCombining Problems on RAC Drawings and Simultaneous Graph Drawings
We present an overview of the first combinatorial results for the so-called geometric RAC simultaneous drawing problem (or GRacSim drawing problem, for short), i.e., a combination of problems on geometric RAC drawings [3] and geometric simultaneous graph drawings [2]. According to this problem, we are given two planar graphs G1 = (V,E1) and G2 = (V,E2) that share a common vertex set but have di...
متن کاملNakano : Planar Drawings of Plane Graphs 3 G 3 G 4 G 5 G 6 G 7 G 8 G 9 G 10 G
Given a plane graph G, we wish to nd a drawing of G in the plane such that the vertices of G are represented as grid points, and the edges are represented as straight-line segments between their endpoints without any edge-intersection. Such drawings are called planar straight-line drawings of G. An additional objective is to minimize the area of the rectangular grid in which G is drawn. In this...
متن کاملA pair of trees without a simultaneous geometric embedding in the plane
Any planar graph has a crossing-free straight-line drawing in the plane. A simultaneous geometric embedding of two n-vertex graphs is a straight-line drawing of both graphs on a common set of n points, such that the edges withing each individual graph do not cross. We consider simultaneous embeddings of two labeled trees, with predescribed vertex correspondences, and present an instance of such...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1505.02708 شماره
صفحات -
تاریخ انتشار 2015